Chain Conditions for Subgroups of Infinite Order or Index
نویسندگان
چکیده
منابع مشابه
Locally Nilpotent Linear Groups with the Weak Chain Conditions on Subgroups of Infinite Central Dimension
Let V be a vector space over a field F . If G≤GL(V, F ), the central dimension of G is the F -dimension of the vector space V/CV (G). In [DEK] and [KS], soluble linear groups in which the set Licd(G) of all proper infinite central dimensional subgroups of G satisfies the minimal condition and the maximal condition, respectively, have been described. On the other hand, in [MOS], periodic locally...
متن کاملSubgroups of Small Index in Infinite Symmetric Groups II
Throughout this paper Q will denote an infinite set, S:= Sym(Q) and G is a subgroup of S. If n: = |Q|, the cardinal of Q, then |.S| = 2". Working in ZFC, set theory with Axiom of Choice (AC), we shall be seeking the subgroups G with \S: G\ < 2". If A £ Q then S^ (respectively G{A}) denotes the setwise stabiliser of A in S (respectively in G); 5(A) and G(A) denote pointwise stabilisers; we ident...
متن کاملSubgroups of finite index and the just infinite property
A residually finite (profinite) group G is just infinite if every non-trivial (closed) normal subgroup of G is of finite index. This paper considers the problem of determining whether a (closed) subgroup H of a just infinite group is itself just infinite. If G is not virtually abelian, we give a description of the just infinite property for normal subgroups in terms of maximal subgroups. In par...
متن کاملanalysis of ruin probability for insurance companies using markov chain
در این پایان نامه نشان داده ایم که چگونه می توان مدل ریسک بیمه ای اسپیرر اندرسون را به کمک زنجیره های مارکوف تعریف کرد. سپس به کمک روش های آنالیز ماتریسی احتمال برشکستگی ، میزان مازاد در هنگام برشکستگی و میزان کسری بودجه در زمان وقوع برشکستگی را محاسبه کرده ایم. هدف ما در این پایان نامه بسیار محاسباتی و کاربردی تر از روش های است که در گذشته برای محاسبه این احتمال ارائه شده است. در ابتدا ما نشا...
15 صفحه اولFirst order optimality conditions for generalized semi-infinite programming problems
In this paper we study first order optimality conditions for the class of generalized semi-infinite programming problems (GSIPs). We extend various wellknown constraint qualifications for finite programming problems to GSIPs and analyze the extent to which a corresponding Karush-Kuhn-Tucker (KKT) condition depends on these extensions. It is shown that in general the KKT condition for GSIPs take...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebra
سال: 2002
ISSN: 0021-8693
DOI: 10.1006/jabr.2001.9085